Transition Semantics for Branching Time
نویسنده
چکیده
In this paper we develop a novel propositional semantics based on the framework of branching time. The basic idea is to replace the moment-history pairs employed as parameters of truth in the standard Ockhamist semantics by pairs consisting of a moment and a consistent, downward closed set of so-called transitions. Whereas histories represent complete possible courses of events, sets of transitions can represent incomplete parts thereof as well. Each transition captures one of the alternative immediate future possibilities open at a branching point. The transition semantics exploits the structural resources a branching time structure has to offer and provides a fine-grained picture of the interrelation of modality and time. In addition to temporal and modal operators, a so-called stability operator becomes interpretable as a universal quantifier over the possible future extensions of a given transition set. The stability operator allows us to specify how and how far time has to unfold for the truth value of a sentence at a moment to become settled and enables a perspicuous treatment of future contingents. We show that the semantics developed along those lines generalizes and extends extant approaches: both Peirceanism and Ockhamism can be viewed as limiting cases of the transition approach that build on restricted resources only, and on both accounts, stability collapses into truth.
منابع مشابه
Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics
Labelled transition systems constitute a widely used model of concurrent computation. They model processes by explicitly describing their states and transitions from state to state, together with the actions that produce these transitions. Several notions of behavioural semantics have been proposed, with the aim to identify those states that afford the same observations. In [13], van Glabbeek p...
متن کاملTitle: Topological Models in Comparative Semantics
During the last three decades several diierent styles of semantics for programming languages have been developed. This thesis compares two of them: the operational and the denotational approach. We show how to give operational and denotational semantics to programming languages, and how to compare diierent semantic models for a given language. Both in the deenition of the denotational semantics...
متن کاملGiorgio Levi ’ s Festschrift Workshop
3 • To understand the work of Giorgio Levi on the semantics of logic programming languages for static analysis • By reconstructing the semantics of Resolution-based/ Logic Programming... ...by abstract interpretations of a concrete semantics ...chosen to be a branching-time trace-based semantics (built from a state transition system) • In passing, we get some novel semantics that tackle impure ...
متن کاملA Sound Observational Semantics for Modal Transition Systems
Modal Transition Systems (MTS) are an extension of Labelled Transition Systems (LTS) that distinguish between required, proscribed and unknown behaviour and come equipped with a notion of refinement that supports incremental modelling where unknown behaviour is iteratively elaborated into required or proscribed behaviour. The original formulation of MTS introduces two alternative semantics for ...
متن کاملA Symbolic Semantics and Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to data parameterised behaviours, and provides a finitely branching representation for behaviours. Symbolic bisimulation is defined. This extends our previous work [14], making the definitions more amenable to automated rea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of logic, language, and information
دوره 25 شماره
صفحات -
تاریخ انتشار 2016